Perfect Secrecy and Statistical
نویسنده
چکیده
There are two key properties of the above. First, given only c, Eve should not be able to learn what m is. Second, Dec(Enc(m)) = m, so that Bob can accurately determine the message that Alice wanted to send. Creating functions Enc and Dec which satisfy this is a fundamental problem of cryptography. But given the above encryption scheme, knowing what these functions are is enough for anyone to decrypt c. This would make it impossible for practical cryptography to be analyzed in the public, for any scheme which is openly discussed would become useless.
منابع مشابه
On The Secrecy of the Cognitive Interference Channel with Channel State
In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...
متن کاملOn Countermeasures to Traffic Analysis Attacks
AbsfrucfThis paper makes three contributions. First, we propose Shannon’s perfect secrecy theory as a foundation for developing countermeasures to traffic analysis attacks on information security systems. A system violating the perfect secrecy conditions can leak mission critical information. Second, we suggest statistical pattern recognition as a fundamental technology to test an information s...
متن کاملTowards Foundations of Cryptography: Investigation of Perfect Secrecy 1
In the spirit of Shannon's theory of secrecy systems we analyse several possible natural deenitons of the notion of perfect secrecy; these deenitions are based on arguments taken from probability theory, information theory, the theory of computational complexity, and the theory of program-size complexity or algorithmic information. It turns out that none of these deenitions models the intuitive...
متن کاملIntroducing Perfect Forward Secrecy for AN.ON
In this paper we discuss AN.ON’s need to provide perfect forward secrecy and show by an estimation of the channel build up time that the straight forward solution is not a practical solution. In the remaining paper we propose an improvement which enables AN.ON to provide perfect forward secrecy with respect to their current attacker model. Finally, we show that the delay, caused by our improvem...
متن کاملPerfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The present paper extends Shannon’s notion of perfect secrecy to ad hoc wireless networks of computers. All of the wireless transmissions are insecure. This paper assumes a secure base-station communicating wirelessly using...
متن کاملTowards Foundations of Cryptographie: Investigation of Perfect Secrecy
In the spirit of Shannon's theory of secrecy systems we analyse several possible natural de nitons of the notion of perfect secrecy; these de nitions are based on arguments taken from probability theory, information theory, the theory of computational complexity, and the theory of program-size complexity or algorithmic information. It turns out that none of these de nitions models the intuitive...
متن کامل